Treatment of Block-Based Sparse Matrices in Domain Decomposition Method
نویسندگان
چکیده
منابع مشابه
Pivoting strategy for fast LU decomposition of sparse block matrices
Solving large linear systems is a fundamental task in many interesting problems, including finite element methods (FEM) or (non-)linear least squares (NLS) for inference in graphical models such as simultaneous localization and mapping (SLAM) in robotics or bundle adjustment (BA) in computer vision. Furthermore, the problems of interest here are sparse. The most time-consuming parts are sparse ...
متن کاملFast Block-Sparse Decomposition Based on SL0
In thispaperwepresent anewalgorithmbasedonSmoothed 0 (SL0), called Block SL0 (BSL0), for Under-determined Systems of Linear Equations (USLE) in which the nonzero elements of the unknown vector occur in clusters. Contrary to the previous algorithms such as Block Orthogonal Matching Pursuit (BOMP) and mixed / 1 norm, our approach provides a fast algorithm, while providing the same (or better) acc...
متن کاملOverlapping Domain Decomposition Algorithms for General Sparse Matrices
Domain decomposition methods for Finite Element problems using a partition based on the underlying nite element mesh have been extensively studied In this paper we discuss algebraic extensions of the class of overlapping domain decomposition algorithms for general sparse matrices The subproblems are created with an overlapping partition of the graph corresponding to the sparsity structure of th...
متن کاملBILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
This paper describes a domain-based multilevel block ILU preconditioner (BILUTM) for solving general sparse linear systems. This preconditioner combines a high accuracy incomplete LU factorization with an algebraic multilevel recursive reduction. Thus, in the first level the matrix is permuted into a block form using (block) independent set ordering and an ILUT factorization for the reordered m...
متن کاملLazy Householder Decomposition of Sparse Matrices
This paper describes Householder reduction of a rectangular sparse matrix to small band upper triangular form Bk+1. Bk+1 is upper triangular with nonzero entries only on the diagonal and on the nearest k superdiagonals. The algorithm is similar to the Householder reduction used as part of the standard dense SVD computation. For the sparse “lazy” algorithm, matrix updates are deferred until a ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of System Modeling and Simulation
سال: 2017
ISSN: 2518-0959
DOI: 10.24178/ijsms.2017.2.1.01